1,008
1.0K

question

######
eye 1,008

######
favorite 1

######
comment 0

Speaker: Eva Maria Feichtner Date: November 2003

Topics: Mathematics, lectures

1,173
1.2K

question

######
eye 1,173

######
favorite 1

######
comment 0

Speaker: Jeorg Rambau Date: July 2003

Topics: Mathematics, Lectures

535
535

question

######
eye 535

######
favorite 0

######
comment 0

Speaker: Joerg Rambau Date: July 2003

Topics: Mathematics, Lectures

744
744

question

######
eye 744

######
favorite 0

######
comment 0

Speaker : Greg Sorkin Keywords : Analysis of algorithms; average-case analysis; branching processes; Brownian motion; phase transition; scaling window; constraint satisfaction; satisfiability. Abstract : A maximum cut in a random graph below the giant component threshold can be found in linear space and linear expected time by a simple algorithm. The same algorithm solves the more general class Max 2-CSP of weighted binary 2-variable constraint satisfaction problems, which includes weighted Max...

Topics: Mathematics, lecture

810
810

question

######
eye 810

######
favorite 1

######
comment 0

Speaker: Nikolai Makarov Date: 05/01/01

Topics: Mathematics, lectures

1,097
1.1K

question

######
eye 1,097

######
favorite 0

######
comment 0

Speaker: Nina Amenta Date: August 2003

Topics: Mathematics, Lectures

3,881
3.9K

question

######
eye 3,881

######
favorite 2

######
comment 0

Speaker: Imre Barany Date: August 2003

Topics: Mathematics, Lectures

6,295
6.3K

question

######
eye 6,295

######
favorite 3

######
comment 2

Speaker : Dave Bayer

favoritefavoritefavoritefavoritefavorite ( 2 reviews )

Topics: Mathematics, lecture

2,705
2.7K

question

######
eye 2,705

######
favorite 2

######
comment 0

Speaker : Dave Bayer

Topics: Mathematics, lecture

723
723

question

######
eye 723

######
favorite 0

######
comment 0

Speaker: Robert K. Lazarsfeld Date: September 2002

Topics: Mathematics, lectures

323
323

question

######
eye 323

######
favorite 0

######
comment 0

Speaker: Robert K. Lazarsfeld Date: September 2002

Topics: Mathematics, lectures

262
262

question

######
eye 262

######
favorite 0

######
comment 0

Speaker: Robert K Lazarsfeld Date: September 2002

Topics: Mathematics, Lectures

367
367

question

######
eye 367

######
favorite 0

######
comment 0

Speaker : Mark Ward Keywords : Analysis of algorithms; data compression; suffix trees; tries; Poissonization; Mellin transform; redundancy; pattern matching. Abstract : We present the asympotics of the distribution and moments of Mn, the matching multiplicity parameter, for tries constructed on independent strings. We also present work-in-progress that Mn for suffix trees has the same asympotic distribution and moments.

Topics: Mathematics, lecture

630
630

question

######
eye 630

######
favorite 1

######
comment 0

Speaker : Philippe Jacquet

Topics: Mathematics, lecture

172
172

question

######
eye 172

######
favorite 0

######
comment 0

Speaker : Vincent Puyhaubert Keywords : Analysis of algorithms; analytic urns, stable limit law, Mellin transform, Fubini theorem, Event generating function, Convergence in distribution Abstract : We present an analytic approach to urn models. The method is the same as in Flajolet-Gabarro-Pekari wich consists in enumerating all events starting from an initial urn. A PDE is obtained for the generating function wich is solved by method of characteristics. Then the analytic study of the GF derives...

Topics: Mathematics, lecture

656
656

question

######
eye 656

######
favorite 0

######
comment 1

Speaker: Jonathan Shewchuk Date: October, 2003

favoritefavoritefavorite ( 1 reviews )

Topics: Mathematics, lectures

422
422

question

######
eye 422

######
favorite 1

######
comment 0

Speaker: Jeffrey Lagarias Date: November, 2003

Topics: Mathematics, lectures

363
363

question

######
eye 363

######
favorite 0

######
comment 0

Speaker : Chuck Knessl Keywords : Analysis of algorithms; Asympotics; WKB method; digital trees; quicksort; binary search trees; matched asympotic expansions. Abstract : We apply singular perturbation techniques to the analysis of algorithms and to trees. Examples include digital tress, binary search trees and quicksort algorithm.

Topics: Mathematics, lecture

525
525

question

######
eye 525

######
favorite 2

######
comment 0

Speaker : Bob Gomph

Topics: Mathematics, lecture

227
227

question

######
eye 227

######
favorite 1

######
comment 0

Speaker : Mortiz Maass Keywords : Analysis of algorithms; approximate pattern matching; tries; average-case analysis; humming distance; indexing. Abstract : We analyze the asympotic average -case behavior of a search process in random tries. A pattern is searched in a set of strings under a certain pair-based error function. Error functions are possible. We find different asympotic behavior dependent on the error probability and the number of mismatches allowed.

Topics: Mathematics, lecture

323
323

question

######
eye 323

######
favorite 1

######
comment 0

Speaker: David Mount Date: October, 2003

Topics: Mathematics, lectures

274
274

question

######
eye 274

######
favorite 1

######
comment 0

Speaker: Timothy Chan Date: October, 2003

Topics: Mathematics, lectures

279
279

question

######
eye 279

######
favorite 1

######
comment 0

Speaker : William P. Thurston

Topics: Mathematics, lecture

484
484

question

######
eye 484

######
favorite 2

######
comment 0

Speaker : William P. Thurston

Topics: Mathematics, lecture

177
177

question

######
eye 177

######
favorite 0

######
comment 0

Speaker: Vladlen Koltun Date: October, 2003

Topics: Mathematics, lectures